Improving Semantic Dependency Parsing with Higher-Order Information Encoded by Graph Neural Networks

نویسندگان

چکیده

Higher-order information brings significant accuracy gains in semantic dependency parsing. However, modeling higher-order is non-trivial. Graph neural networks (GNNs) have been demonstrated to be an effective tool for encoding many graph learning tasks. Inspired by the success of GNNs, we investigate improving parsing with encoded multi-layer GNNs. Experiments are conducted on SemEval 2015 Task 18 dataset three languages (Chinese, English, and Czech). Compared previous state-of-the-art parser, our parser yields 0.3% 2.2% improvement average labeled F1-score English in-domain (ID) out-of-domain (OOD) test sets, 2.6% Chinese ID set, 2.0% 1.8% Czech OOD sets. Experimental results show that outperforms best one languages. The outstanding performance demonstrates GNNs exceedingly beneficial SDP.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-order Graph-based Neural Dependency Parsing

In this work, we present a novel way of using neural network for graph-based dependency parsing, which fits the neural network into a simple probabilistic model and can be furthermore generalized to high-order parsing. Instead of the sparse features used in traditional methods, we utilize distributed dense feature representations for neural network, which give better feature representations. Th...

متن کامل

Improving Dependency Parsing with Semantic Classes

This paper presents the introduction of WordNet semantic classes in a dependency parser, obtaining improvements on the full Penn Treebank for the first time. We tried different combinations of some basic semantic classes and word sense disambiguation algorithms. Our experiments show that selecting the adequate combination of semantic features on development data is key for success. Given the ba...

متن کامل

Semantic Dependency Graph Parsing Using Tree Approximations

In this contribution, we deal with graph parsing, i.e., mapping input strings to graph-structured output representations, using tree approximations. We experiment with the data from the SemEval 2014 Semantic Dependency Parsing (SDP) task. We define various tree approximation schemes for graphs, and make twofold use of them. First, we statically analyze the semantic dependency graphs, seeking to...

متن کامل

Transition-Based Chinese Semantic Dependency Graph Parsing

Chinese semantic dependency graph is extended from semantic dependency tree, which uses directed acyclic graphs to capture richer latent semantics of sentences. In this paper, we propose two approaches for Chinese semantic dependency graph parsing. In the first approach, we build a non-projective transition-based dependency parser with the Swap-based algorithm. Then we use a classifier to add a...

متن کامل

Generative Incremental Dependency Parsing with Neural Networks

We propose a neural network model for scalable generative transition-based dependency parsing. A probability distribution over both sentences and transition sequences is parameterised by a feedforward neural network. The model surpasses the accuracy and speed of previous generative dependency parsers, reaching 91.1% UAS. Perplexity results show a strong improvement over n-gram language models, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2022

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app12084089